Independent domination in hereditary classes
نویسندگان
چکیده
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملGlobal Alliances and Independent Domination in Some Classes of Graphs
A dominating set S of a graph G is a global (strong) defensive alliance if for every vertex v ∈ S, the number of neighbors v has in S plus one is at least (greater than) the number of neighbors it has in V \ S. The dominating set S is a global (strong) offensive alliance if for every vertex v ∈ V \ S, the number of neighbors v has in S is at least (greater than) the number of neighbors it has i...
متن کاملDomination in distance-hereditary graphs
The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes th...
متن کاملHereditary Domination & Independence Parameters
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.10.049